GLOBAL SYNCHRONIZATION ALGORITHMS FOR THE INTEL IPSC/860
نویسندگان
چکیده
منابع مشابه
Global Synchronization Algorithms for the Intel iPSC/860
In a distributed memory multicomputer that has no global clock, global processor synchronization can only be achieved through software. Global synchronization algorithms are used in tridiagonal systems solvers, CFD codes, sequence comparison algorithms, and sorting algorithms. They are also useful for event simulation, debugging, and for solving mutual exclusion problems. For the Intel iPSC/860...
متن کاملSelf-Tuning Intel Transactional Synchronization Extensions
Transactional Memory was recently integrated in Intel processors under the name TSX. We show that its performance can be significantly affected by the configuration of its interplay with the software-based fallback: in fact, there does not seem to exist a single configuration that can perform best independently of the application and workload. We address this challenge by introducing an innovat...
متن کاملBalancing contention and synchronization on the Intel Paragon
The Intel Paragon is a mesh-connected distributed memory parallel computer. It uses an oblivious and deterministic message routing algorithm: this permits us to develop highly optimized schedules for frequently needed communication patterns. The complete exchange is one such pattern. Several approaches are available for carrying it out on the mesh. We study an algorithm developed by Scott. This...
متن کاملGlobal synchronization on the circle ⋆
The convexity arguments used in the consensus literature to prove synchronization in vector spaces can be applied to the circle only when all agents are initially located on a semicircle. Existing strategies for (almost-)global synchronization on the circle are either restricted to specific interconnection topologies or use auxiliary variables. The present paper first illustrates this problem b...
متن کاملEffective Barrier Synchronization on Intel Xeon Phi Coprocessor
Barriers are a fundamental synchronization primitive, underpinning the parallel execution models of many modern shared-memory parallel programming languages such as OpenMP, OpenCL or Cilk, and are one of the main challenges to scaling. State-of-the-art barrier synchronization algorithms differ in tradeoffs between critical path length, communication traffic patterns and memory footprint. In thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of High Speed Computing
سال: 1994
ISSN: 0129-0533
DOI: 10.1142/s0129053394000263